Generic functional programming with types and relations
نویسندگان
چکیده
منابع مشابه
Generic Programming with Dependent Types
Some programs are doubly generic. For example, map is datatype-generic in that many different data structures support a mapping operation. A generic programming language like Generic Haskell can use a single definition to generate map for each type. However, map is also arity-generic because it belongs to a family of related operations that differ in the number of arguments. For lists, this fam...
متن کاملGeneric Programming with Dependent Types
Generic programming Generic programming [15, 21] allows programmers to explain how a single algorithm can be instantiated for a variety of datatypes, by computation over each datatype’s structure. Dependent types Dependent types [28, 37] are types containing data which enable the programmer to express properties of data concisely, covering the whole spectrum from conventional uses of types to t...
متن کاملFunctional Programming with Relations
While programming in a relational framework has much to o er over the functional style in terms of expressiveness, computing with relations is less e cient, and more semantically troublesome. In this paper we propose a novel blend of the functional and relational styles. We identify a class of causal relations , which inherit some of the bi{directionality properties of relations, but retain the...
متن کاملCoCaml: Functional Programming with Regular Coinductive Types
Functional languages offer a high level of abstraction, which results in programs that are elegant and easy to understand. Central to the development of functional programming are inductive and coinductive types and associated programming constructs, such as pattern-matching. Whereas inductive types have a long tradition and are well supported in most languages, coinductive types are subject of...
متن کاملSemantics and Types in Functional Logic Programming
The rewriting logic CRWL has been proposed as a semantic framework for higher-order functional logic programming, using applicative rewriting systems as programs and lazy narrowing as the goal solving procedure. We present an extension of CRWL with a polymorphic type system, and we investigate the consequences of type discipline both at the semantic level and at the operational level. Semantica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 1996
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796800001556